Typed lambda calculi and possible worlds models
نویسنده
چکیده
Course overview (current plan; adjustable) i. Typed lambda calculi and possible worlds models ii. Alternative approaches to meaning iii. Grounded language understanding iv. Question answering: Grounding in databases v. Stochastic lambda calculus vi. Distributional approaches to word meanings vii. Composition in vector-space models 1: tensors viii. Composition in vector-space models 2: recursive neural networks
منابع مشابه
A New Model Construction for Various Type Systems
A construction of nondomain models for various type systems such as Martin-Löf’s type theory with intensional identity types, the polymorphic lambda calculus and other extensions of the simply typed lambda calculus is presented. These extensions include nearly all calculi in Barendregt’s lambda cube enriched by strong sums. The models can be arranged in such a way that the universal type Πα. α ...
متن کاملLinear realizability and full completeness for typed lambda-calculi
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...
متن کاملSimply Easy! An Implementation of a Dependently Typed Lambda Calculus
We present an implementation in Haskell of a dependently-typed lambda calculus that can be used as the core of a programming language. We show that a dependently-typed lambda calculus is no more difficult to implement than other typed lambda calculi. In fact, our implementation is almost as easy as an implementation of the simply typed lambda calculus, which we emphasize by discussing the modif...
متن کاملSemantics of a Typed Algebraic Lambda-Calculus
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We sketch the relation with two established vectorial lambda-calculi. Then we study the problems arising from the addition of a fixed point combinator and how to m...
متن کاملA typed, algebraic, computational lambda-calculus
Lambda-calculi with vectorial structures have been studied in various ways, but their semantics remain mostly untouched. The main contribution of this paper is to provide a categorical framework for the semantics of such algebraic lambda-calculi. We first develop a categorical analysis of a general simply-typed lambda-calculus endowed with a structure of module. We study the problems arising fr...
متن کامل